Bounds for One-dimensional Cellular Automata: A Linear Algebraic Approach
نویسندگان
چکیده
In [CK05], E. Czeizler and J. Kari used a linear algebraic tool to obtain good upper bounds for the length of the inverse neighbourhood of reversible one-dimensional cellular automata (CA). Recently, a linear algebraic approach similar to the one used by J. Kari in [Kar03], lead to better upper bounds for the length of the shortest unbalanced words, shortest orphans and shortest diamonds of non-surjective one-dimensional CA. In this thesis, all these results are presented in a coherent way. We generalize and improve some of the results.
منابع مشابه
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do not change the quantum cellular automata’s computational power. The configurations we consider have finite but unbounded size.
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملBounds on Non-surjective Cellular Automata
Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of di erent words starting and ending identically and having the same image (diamonds) and words with more/fewer preimages than the average number (unbalanced words). Using a linear algebra approach, we obtain new upper bounds on the leng...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملColor Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules
-. Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new model is introduced using color graphs to model all the 512 linear rules. The graph theoretic properties therefore studied in this paper simplifies the analysis o...
متن کامل